A new GA-Local Search Hybrid for Continuous Optimization Based on Multi-Level Single Linkage Clustering
نویسندگان
چکیده
Hybrid algorithms formed by the combination of Genetic Algorithms with Local Search methods provide increased performances when compared to real coded GA or Local Search alone. However, the cost of Local Search can be rather high. In this paper we present a new hybrid algorithm which reduces the total cost of local search by avoiding the start of the method in basins of attraction where a local optimum has already been discovered. Additionally, the clustering information can be used to help the maintenance of diversity within the population.
منابع مشابه
A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملHybrid Teaching-Learning-Based Optimization and Harmony Search for Optimum Design of Space Trusses
The Teaching-Learning-Based Optimization (TLBO) algorithm is a new meta-heuristic algorithm which recently received more attention in various fields of science. The TLBO algorithm divided into two phases: Teacher phase and student phase; In the first phase a teacher tries to teach the student to improve the class level, then in the second phase, students increase their level by interacting amon...
متن کاملSolving “Resource Constrained Project Scheduling Problem” (RCPSP) with Bench Marked Hybrid Algorithm’s
In the paper, we give illustrated reviews, new approaches and results of how rcps –problems are being solved with Hybrid algorithm’s. Firstly, considering Hybrid Genetic Algorithm (HGA), Vicente a et al 2007, introducing many changes in Genetic algorithm (GA) paradigm, resulting in HGA giving fast and high quality algorithms out performing state-of-the-art-algorithm (SOTAA). for rcps-problem. S...
متن کامل